Generic Initial Ideals and Exterior Algebraic Shifting of the Join of Simplicial Complexes
نویسنده
چکیده
In this paper, the relation between algebraic shifting and join which was conjectured by Eran Nevo will be proved. Let σ and τ be simplicial complexes and σ ∗ τ their join. Let Jσ be the exterior face ideal of σ and ∆(σ) the exterior algebraic shifted complex of σ. Assume that σ ∗ τ is a simplicial complex on [n] = {1, 2, . . . , n}. For any d-subset S ⊂ [n], let m revS(σ) denote the number of d-subsets R ∈ σ which is equal to or smaller than S w.r.t. the reverse lexicographic order. We will prove thatm revS(∆(σ ∗ τ )) ≥ m revS(∆(∆(σ)∗∆(τ))) for all S ⊂ [n]. To prove this fact, we also prove that m revS(∆(σ)) ≥ m revS(∆(∆φ(σ))) for all S ⊂ [n] and for all non-singular matrices φ, where ∆φ(σ) is the simplicial complex defined by J∆φ(σ) = in(φ(Jσ)).
منابع مشابه
Generic Initial Ideals and Exterior Algebraic Shifting of Join of Simplicial Complexes
The relation between algebraic shifting and join which was conjectured by Nevo [8] is studied. Let σ ∗ τ denote a join of two simplicial complexes σ and τ . Let ∆(σ) denote the exterior algebraic shifting of a simplicial complex σ. In the present paper, we will prove ∆(σ ∗ τ) ≤L ∆(∆(σ) ∗∆(τ)).
متن کاملar X iv : 0 70 7 . 06 78 v 1 [ m at h . A C ] 4 J ul 2 00 7 GENERIC INITIAL IDEALS AND FIBRE PRODUCTS
We study the behavior of generic initial ideals with respect to fibre products. In our main result we determine the generic initial ideal of the fibre product with respect to the reverse lexicographic order. As an application we compute the symmetric algebraic shifted complex of two disjoint simplicial complexes as was conjectured by Kalai. This result is the symmetric analogue of a theorem of ...
متن کاملAlgebraic Shifting and Basic Constructions on Simplicial Complexes
We try to understand the behavior of algebraic shifting with respect to some basic constructions on simplicial complexes, such as union, coning, and (more generally) join. In particular, for the disjoint union of simplicial complexes we prove ∆(K∪̇L) = ∆(∆(K)∪̇∆(L)) (conjectured by Kalai [2]), and for the join we give an example of simplicial complexes K and L for which ∆(K ∗ L) 6= ∆(∆(K) ∗∆(L)) ...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملGröbner Basis Techniques in Algebraic Combinatorics
Gröbner basis techniques in the algebraic study of triangulations of convex polytopes as well as of the number of faces of simplicial complexes will be discussed. Of these two traditional topics in combinatorics, the first will be studied by using initial ideals of toric ideals and the second will be studied by using generic initial ideals of monomial ideals.
متن کامل